DTiGEMS+: drug–target interaction prediction using graph embedding, graph mining, and similarity-based techniques
نویسندگان
چکیده
منابع مشابه
Link Prediction using Network Embedding based on Global Similarity
Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...
متن کاملOmni Graph Mining: Graph mining using RDBMS
In this study, we compare three approaches to implement graph algorithms SQL, MapReduce, and GraphChi in terms of performance and cost efficiency. Since MapReduce was introduced, it has been considered as a standard tool to analyze large scale data including graph data. However, we believe that there is a ‘sweet spot’ in which RDBMS can outperform MapReduce. We think that the performance of the...
متن کاملGene Function Prediction via Discriminative Graph Embedding
Gene function has been a subject of interest but it is far from fully understood. It is known that some genes have certain functions but it is not clear whether those are all the functions they have. It is a recent trend to use different means to predict gene functions; one of them is to use computational methods on large data sets. Different types of information are used in computational metho...
متن کاملGraph Embedding Using Constant Shift Embedding
In the literature, although structural representations (e.g. graph) are more powerful than feature vectors in terms of representational abilities, many robust and efficient methods for classification (unsupervised and supervised) have been developed for feature vector representations. In this paper, we propose a graph embedding technique based on the constant shift embedding which transforms a ...
متن کاملSimulation-Based Graph Similarity
We present symmetric and asymmetric similarity measures for labeled directed rooted graphs that are inspired by the simulation and bisimulation relations on labeled transition systems. Computation of the similarity measures has close connections to discounted Markov decision processes in the asymmetric case and to perfect-information stochastic games in the symmetric case. For the symmetric cas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cheminformatics
سال: 2020
ISSN: 1758-2946
DOI: 10.1186/s13321-020-00447-2